Tensor completion using geodesics on Segre manifolds
نویسندگان
چکیده
We propose a Riemannian conjugate gradient algorithm for approximating incomplete tensors by canonical polyadic decompositions of low rank. Our main contribution consists an explicit expression almost everywhere complete set geodesics the Segre manifold rank-1 tensors. These are leveraged in our optimization over geometrically convenient parametrization rank- r $$ to move direction tangent vector -fold product manifolds. apply method movie rating predictions recommender system MovieLens dataset, and identifying pure fluorophores via fluorescent spectroscopy with missing data. In this last application, we can recover tensor decomposition from only 6 . 5 % 6.5\% numerical experiments, proposed was competitive state-of-the-art quasi-Newton truncated inner solves Tensorlab terms accuracy could reduce computation time half.
منابع مشابه
Interpolation using Hankel tensor completion
We present a novel multidimensional seismic trace interpolator that works on constant-frequency slices. It performs completion on Hankel tensors whose order is twice the number of spatial dimensions. Completion is done by fitting a PARAFAC model using an Alternating Least Squares algorithm. The new interpolator runs quickly and can better handle large gaps and high sparsity than existing comple...
متن کاملSolving Interpolation Problems on Stiefel Manifolds Using Quasi-geodesics
The main objective of this paper is to propose a new method to generate smooth interpolating curves on Stiefel manifolds. This method is obtained from a modification of the geometric Casteljau algorithm on manifolds and is based on successive quasi-geodesic interpolation. The quasi-geodesics introduced here for Stiefel manifolds have constant speed, constant covariant acceleration and constant ...
متن کاملGeodesics on Non–complete Finsler Manifolds
In this note based on paper [3] we deal with domains D (i.e. connected open subsets) of a Finsler manifold (M, F ). At first we carry out a comparison between different notions of convexity for their boundaries. Then a careful application of variational methods to the geodesic problem yields that the convexity of ∂D is equivalent to the existence of a minimal geodesic for each pair of points of...
متن کاملGraph approximations to geodesics on embedded manifolds
0 Introduction In [1] Tenenbaum, de Silva and Langford consider the problem of non-linear dimensionality reduction: discovering intrinsically low-dimensional structures embedded in high-dimensional data sets. They describe an algorithm, called Isomap, and demonstrate its successful application to several real and synthetic data sets. In this paper, we discuss some of the theoretical claims for ...
متن کاملTensor Completion
The purpose of this thesis is to explore the methods to solve the tensor completion problem. Inspired by the matrix completion problem, the tensor completion problem is formulated as an unconstrained nonlinear optimization problem, which finds three factors that give a low-rank approximation. Various of iterative methods, including the gradient-based methods, stochastic gradient descent method ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Linear Algebra With Applications
سال: 2022
ISSN: ['1070-5325', '1099-1506']
DOI: https://doi.org/10.1002/nla.2446